Geometric Data Structures for Games: Index Structures
نویسنده
چکیده
Index Structures: We continue our discussion of useful geometric data structure for computer games. So far we have discussed data structures for representing meshes (and more generally, cell complexes), geometric graphs (such as the visibility graph, θ-graph), and spatial subdivisions (such as the Delaunay triangulation). Usually, when we think of data structures for 1-dimensional data (such as hash maps, binary trees, and skip lists), the data structure is a means for efficiently accessing data based on a key value. A data structure that locates an object based on a key value is called an index structure.
منابع مشابه
ANT COLONY ALGORITHMS FOR NONLINEAR ANALYSIS AND OPTIMAL DESIGN OF STRUCTURES
In this paper nonlinear analysis of structures are performed considering material and geometric nonlinearity using force method and energy concepts. For this purpose, the complementary energy of the structure is minimized using ant colony algorithms. Considering the energy term next to the weight of the structure, optimal design of structures is performed. The first part of this paper contains ...
متن کاملA Complete Geometric Representation of Four-Player Weighted Voting Systems
The relatively new weighted voting theory applies to many important organizations such as the United States Electoral College and the International Monetary Fund. Various power indexes are used to establish a relationship between weights and influence; in 1965, the Banzhaf Power Index was used to show that areas of Nassau County were unrepresented in the county legislature. It is of interest to...
متن کاملTarget detection Bridge Modelling using Point Cloud Segmentation Obtained from Photogrameric UAV
In recent years, great efforts have been made to generate 3D models of urban structures in photogrammetry and remote sensing. 3D reconstruction of the bridge, as one of the most important urban structures in transportation systems, has been neglected because of its geometric and structural complexity. Due to the UAV technology development in spatial data acquisition, in this study, the point cl...
متن کاملGeometric and Electronic Structures of Vanadium Sub-nano Clusters, Vn (n = 2-5), and their Adsorption Complexes with CO and O2 Ligands: A DFT-NBO Study
In this study, electronic structures of ground state of pure vanadium sub-nano clusters, Vn (n=2-5), and their interactions with small ligands for example CO and triplet O2 molecules are investigated by using density functional theory (DFT) calibration at the mPWPW91/QZVP level of theory. The favorable orientations of these ligands in interaction with pure vanadium sub-nano clusters were determ...
متن کاملGeometric Suffix Tree: A New Index Structure for Protein 3-D Structures
Protein structure analysis is one of the most important research issues in the post-genomic era, and faster and more accurate query data structures for such 3-D structures are highly desired for research on proteins. This paper proposes a new data structure for indexing protein 3-D structures. For strings, there are many efficient indexing structures such as suffix trees, but it has been consid...
متن کامل